MiniLearningHeapExpSimp / SAT4J

The SAT4J library [1] is an open source library of efficient SAT solvers in Java dedicated to people willing to embed SAT technology into their application without worrying about the details. SAT4J is currently used in model verification [10], ontology matching [5], requirements engineering [11], software product line configuration [2], etc. It started as a Java implementation of the MiniSAT specification [3], and evolved as a library when the solver was modularized to provide several heuristics, conflict analysis schemes, data structures, etc. One of the main feature in SAT4J solvers is the possibility to filter the constraints to learn after conflict analysis, since learning is not mandatory for backtracking, which is in contrast with usual conflict driven clause learning solvers [7]. The library can also handle cardinality or pseudo boolean constraints using full cutting planes reasoning. The library provides builtin CSP to SAT translators. Finally, a simple optimization scheme is provided, allowing basic MaxSAT and Weighted-MaxSAT solving.